Buscar
Mostrando ítems 1-10 de 1852
Aggregated 2D range queries on clustered points
(Pergamon-Elsevier Science, 2016)
Efficient processing of aggregated range queries on two-dimensional grids is a common requirement in information retrieval and data mining systems, for example in Geographic Information Systems and OLAP cubes. We introduce ...
Paged similarity queries
(ELSEVIER SCIENCE INC, 2011)
An important feature of a database management systems (DBMS) is its client/server architecture, where managing shared memory among the clients and the server is always an tough issue. However, similarity queries are specially ...
Query rewriting for semantic query optimization in spatial databases
(2019)
Query processing is an important challenge for spatial databases due to the use of complex data types that represent spatial attributes. In particular, due to the cost of spatial joins, several optimization algorithms based ...
A survey of RDF stores & SPARQL engines for querying knowledge graphs
(Springer, 2021)
RDF has seen increased adoption in recent years, prompting the standardization of the SPARQL query language for RDF, and the development of local and distributed engines for processing SPARQL queries. This survey paper ...
Managing continuous k-nearest neighbor queries in mobile peer-to-peer networks.
(2008)
A continuous k nearest neighbor (CKINN) query retrieves the set of k mobile nodes that are nearest to a query point, and provides real-time updats whenever this set of nodes changes. A CKNN query can be either stationary ...
Efficient Optimization and Processing of Queries over Text-rich Graph-structured Data
Many databases today capture both, structured and unstructured data. Making use of such hybrid data has become an important topic in research and industry. The efficient evaluation of hybrid data queries is the main topic ...
A DFT-Based Running Time Prediction Algorithm for Web Queries
(MDPI, 2021-08)
Web search engines are built from components capable of processing large amounts of user queries per second in a distributed way. Among them, the index service computes the topk documents that best match each incoming query ...
Performance evaluation of single vs. batch of queries on GPUs
(John Wiley & Sons Ltd, 2019-08)
The WAND processing strategy is a dynamic pruning algorithm designed for large scale Web search engines where fast response to queries is a critical service. The WAND is used to reduce the amount of computation by scoring ...